Self-similarity and Random Walks
نویسنده
چکیده
This is an introductory level survey of some topics from a new branch of fractal analysis — the theory of self-similar groups. We discuss recent works on random walks on self-similar groups and their applications to the problem of amenability for these groups.
منابع مشابه
The linking number and the writhe of uniform random walks and polygons in confined spaces
Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. We show that the mean squared linking number, the mean squared writhe and the ...
متن کاملar X iv : 0 80 9 . 16 12 v 1 [ m at h . PR ] 9 S ep 2 00 8 CORRELATED CONTINUOUS TIME RANDOM WALKS
Continuous time random walks impose a random waiting time before each particle jump. Scaling limits of heavy tailed continuous time random walks are governed by fractional evolution equations. Space-fractional derivatives describe heavy tailed jumps, and the time-fractional version codes heavy tailed waiting times. This paper develops scaling limits and governing equations in the case of correl...
متن کاملCorrelated continuous time random walks
Continuous time random walks impose a random waiting time before each particle jump. Scaling limits of heavy-tailed continuous time random walks are governed by fractional evolution equations. Space-fractional derivatives describe heavy-tailed jumps, and the time-fractional version codes heavy-tailedwaiting times. This paper develops scaling limits and governing equations in the case of correla...
متن کاملMaximum likelihood estimators and random walks in long memory models
We consider statistical models driven by Gaussian and non-Gaussian self-similar processes with long memory and we construct maximum likelihood estimators (MLE) for the drift parameter. Our approach is based in the non-Gaussian case on the approximation by random walks of the driving noise. We study the asymptotic behavior of the estimators and we give some numerical simulations to illustrate ou...
متن کاملA Class of Weakly Self-avoiding Walks
We define a class of weakly self-avoiding walks on the integers by conditioning a simple random walk of length n to have a p-fold self-intersection local time smaller than nβ, where 1 < β < (p+1)/2. We show that the conditioned paths grow of order nα, where α = (p− β)/(p− 1), and also prove a coarse large deviation principle for the order of growth.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009